Identity-Based Proxy Signature from Pairings
نویسندگان
چکیده
A proxy signature scheme allows an entity to delegate its signing capability to another entity (proxy) in such a way that the proxy can sign messages on behalf of the delegator. Proxy signatures have found numerous practical applications such as distributed systems, mobile agent applications, etc. Recently, Xu, Zhang and Feng proposed the first formal models of identity based proxy signature. Unfortunately, their model does not capture the notion of adaptively chosen message and chosen identity attacker in identity based system. In this paper, we redefine the security models of identity based proxy signature to capture the most stringent attacks against adaptively chosen message and chosen identity attacker. We also propose a new provably secure identity basad proxy signature scheme whose security is based on the hardness of Computational Diffie-Hellman problem in the random oracle model.
منابع مشابه
An Identity-Based Multi-Proxy Multi-Signature Scheme Without Bilinear Pairings and its Variants
The notions of identity-based multi-proxy signature, proxy multi-signature and multi-proxy multisignature have been proposed to facilitate public key certificate management of these kinds of signatures by merely employing signer’s identities in place of the public keys and their certificates. In the literature, most identitybased multi-proxy signature, proxy multi-signature and multi-proxy mult...
متن کاملAn ID-based Anonymous Proxy Signature From Bilinear Pairings
Abstract: A new ID-based anonymous proxy signature scheme from bilinear pairings was proposed in this paper. Anonymous proxy signature is suitable for the situation that the proxy signer’s identity needs to be kept secret. The verifier needs to reveal the real identity of the proxy signer with the help of the original signer. The signature is based on Gap Diffie-Hellman group problems and meets...
متن کاملIdentity Based Proxy Signature from RSA without Pairings
RSA is a key cryptography technique and provides various interfaces for the applied software in real-life scenarios. Although some good results were achieved in speeding up the computation of pairing function in recent years, the computation cost of the pairings is much higher than that of the exponentiation in a RSA group. So it is still interesting to design efficient cryptosystems based on R...
متن کاملAn Efficient Identity based Multi-Proxy Multi-Signcryption Scheme from Bilinear Pairings
Signcryption is a cryptography primitive that fulfills both the functions of digital signature and encryption and guarantees non-repudiation, confidentiality and integrity in a more efficient way. In this paper, we propose an efficient and secure identity based multi-proxy multi signcryption scheme from bilinear pairings. In this scheme a group of proxy signcrypters could authorize by a group o...
متن کاملEfficient ID-Based Blind Signature and Proxy Signature from Bilinear Pairings
Blind signature and proxy signature are very important technologies in secure e-commerce. Identity-based (simply ID-based) public key cryptosystem can be a good alternative for certificate-based public key setting, especially when efficient key management and moderate security are required. In this paper, we propose a new ID-based blind signature scheme and an ID-based partial delegation proxy ...
متن کاملIdentity Based Threshold Proxy Signature
Identity-based (ID-based) public key cryptosystem can be a good alternative for certificate-based public key setting, especially when efficient key management and moderate security are required. In a (t, n) threshold proxy signature scheme, the original signer delegates the power of signing messages to a designated proxy group of n members. Any t or more proxy signers of the group can cooperati...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007